Internet-Based Administration of Shared Instruments with Facility Online Manager

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOR THE FACILITY MANAGER Theory of Flocculation

The term flocculation is often confused with coagulation, although the two refer to different processes. Coagulation is basically electrostatic in nature. It is brought about by a reduction of the repulsive potential of the electrical double layer. The term flocculation is derived from the Latin, “flocculus,” literally a small tuft of wool, or a loosely fibrous structure. Flocculation is brough...

متن کامل

MAGNET: A Virtual Shared Tuplespace Resource Manager

Traditional operating systems limit J?exibili@, performance and utilization of hardware resources by Jwcing applications to use inappropriate high-level abstractions, uniform protection schemes and high-level :ttatic resource management. This forced use of inappropriate services results in poor application and operating system performance. A radical new approach [o operating systems design and ...

متن کامل

Online Personalization of Hearing Instruments

Online personalization of hearing instruments refers to learning preferred tuning parameter values from user feedback through a control wheel (or remote control), during normal operation of the hearing aid. We perform hearing aid parameter steering by applying a linear map from acoustic features to tuning parameters. We formulate personalization of the steering parameters as the maximization of...

متن کامل

Online Facility Assignment

We consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj . The total number of customers is at most |F |l and each customer must be assigned ...

متن کامل

Online Facility Location

We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized onlineO(1)-competitive algorithm in the case where points arrive in random order. If points are ordered adversarially, we show that no algorithm can be constant-competitive, and provide an O(logn)-competitive a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Microscopy Today

سال: 2006

ISSN: 1551-9295,2150-3583

DOI: 10.1017/s1551929500058867